Global Optimization of Water Management Problems Using Linear Relaxation and Bound Contraction Methods
نویسندگان
چکیده
In this paper, we present results of a recently developed global optimization method as applied to water management problems. Our method deals effectively with MINLP problems with bilinear and univariate concave terms. Bilinear terms show up in these problems as products of flow rates and concentrations in component balances. In turn, concave terms are typically associated with equipment costs.
منابع مشابه
Novel bound contraction procedure for global optimization of bilinear MINLP problems with applications to water management problems
We propose a new method to obtain the global optimum of MINLP problems containing bilinearities. Our special method that contracts the bounds of one variable at a time allows reducing the gap between eceived in revised form 6 April 2010 ccepted 8 April 2010 vailable online 14 April 2010 eywords: athematical programming ptimization a linear lower bound and an upper bound obtained solving the ori...
متن کاملOptimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
We address nonconvex mixed-integer bilinear problems where the main challenge is the computation of a tight upper bound for the objective function to be maximized. This can be obtained by using the recently developed concept of multiparametric disaggregation following the solution of a mixed-integer linear relaxation of the bilinear problem. Besides showing that it can provide better bounds tha...
متن کاملA New Approach for Global Optimization of a Class of MINLP Problems with Applications to Water Management and Pooling Problems
One of the biggest challenges in solving optimization engineering problems is rooted in the nonlinearities and nonconvexities, which arise from bilinear terms corresponding to component material balances and/or concave functions used to estimate capital cost of equipments. The procedure proposed uses an MILP lower bound constructed using partitioning of certain variables, similar to the one use...
متن کاملOn Solving Nonconvex Optimization Problems by Reducing The Duality Gap
Lagrangian bounds, i.e. bounds computed by Lagrangian relaxation, have been used successfully in branch and bound bound methods for solving certain classes of nonconvex optimization problems by reducing the duality gap. We discuss this method for the class of partly linear and partly convex optimization problems and, incidentally, point out incorrect results in the recent literature on this sub...
متن کاملConvex Relaxation Methods for Nonconvex Polynomial Optimization Problems
This paper introduces to constructing problems of convex relaxations for nonconvex polynomial optimization problems. Branch-and-bound algorithms are convex relaxation based. The convex envelopes are of primary importance since they represent the uniformly best convex underestimators for nonconvex polynomials over some region. The reformulationlinearization technique (RLT) generates LP (linear p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011